Majorization, Polyhedra and Statistical Testing Problems. Majorization, Polyhedra and Statistical Testing Problems
نویسنده
چکیده
There are important connections between majorization and convex polyhedra. Both weak majorization and majorization are preorders related to certain simple convex cones. We investigate the facial structure of a polyhedral cone C associated with a layered directed graph. A generalization of weak majorization based on C is introduced. It de nes a preorder of matrices. An application in statistical testing theory is discussed in some detail.
منابع مشابه
Modelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملPolyhedra and Optimization in Connection with a Weak Majorization Ordering
We introduce the concept of weak k-majorization extending the classical notion of weak sub-majorization. For integers k and n with k n a vector x 2 R is weakly k-majorized by a vector q 2 R if the sum of the r largest components of x does not exceed the sum of the r largest components of q, for r = 1; : : : ; k. For a given q the set of vectors weakly k-majorized by q de nes a polyhedron P (q;k...
متن کاملStatistical Functionals Consistent with a Weak Relative Majorization Ordering: Applications to the Mimimum Divergence Estimation
Most of the statistical estimation procedures are based on a quite simple principle: find the distribution that, within a certain class, is as similar as possible to the empirical distribution, obtained from the sample observations. This leads to the minimization of some statistical functionals, usually interpreted ad measures of distance or divergence between distributions. In this paper we st...
متن کاملComparing Partition and Random Testing via Majorization and Schur Functions
The comparison of partition and random sampling methods for software testing has received considerable attention in the literature. A standard criterion for comparisons between random and partition testing based on their expected efficacy in program debugging is the probability of detecting at least one failure causing input in the program’s domain. We investigate the relative effectiveness of ...
متن کاملSharp quadratic majorization in one dimension
Majorization methods solve minimization problems by replacing a complicated problem by a sequence of simpler problems. Solving the sequence of simple optimization problems guarantees convergence to a solution of the complicated original problem. Convergence is guaranteed by requiring that the approximating functions majorize the original function at the current solution. The leading examples of...
متن کامل